Full-information best choice game with hint

Winning Rate in the Full-Information Best Choice Problem

Following a long-standing suggestion by Gilbert and Mosteller, we derive an explicit formula for the asymptotic winning rate in the full-information problem of the best choice.

A non-zero-sum no-information best-choice game

A given number of n applicants are to be interviewed for a position of secretary. They present themselves one-by-one in random order, all n! permutations being equally likely. Two players I and II jointly interview the i-th applicant and observe that his (or her) relative rank is y for I and z for II, relative to i − 1 applicants that have already seen (rank 1 is for the best). Each player choo...

Selecting the best choice in the full information group interview problem

We consider the problem of selecting the single best choice when several groups of choices are presented sequentially for evaluation. In the so-called group interview problem, we assume that the values of choices are random observations from a known distribution function and derive the optimal search strategy that maximizes the probability of selecting the best among all choices. Under the opti...

Optimal Choice of the Best Available Applicant in Full-information Models

The problem we consider here is a full-information best-choice problem in which n applicants appear sequentially, but each applicant refuses an offer independently of other applicants with known fixed probability 0 ≤ q < 1. The objective is to maximize the probability of choosing the best available applicant. Two models are distinguished according to when the availability can be ascertained; th...

On a Best Choice Problem with Partial Information